On combining implementable social choice rules
نویسندگان
چکیده
We study if (and when) the intersections and unions of social choice rules that are implementable with respect to a certain equilibrium concept are themselves implementable with respect to that equilibrium concept. While the results for dominant strategy equilibrium are mostly of negative nature, the situation is di¤erent in the case of Nash implementation. We nd that the union of any set of Nash implementable social choice rules is Nash implementable (for societies of at least three constituents), while the intersection of nitely many such correspondences is almostNash implementable (even in the case of two-person societies). The former observation allows us to formulate the notion of the largest Nash implementable subcorrespondence of a social choice rule.
منابع مشابه
Nash implementation via hyperfunctions
Hyperfunctions are social choice rules which assign sets of alternatives to preference profiles over sets. So, they are more general objects compared to standard (social choice) correspondences. Thus every correspondence can be expressed in terms of an equivalent hyperfunction. We postulate the equivalence between implementing a correspondence and its equivalent hyperfunction. We give a partial...
متن کاملMaskin-monotonic scoring rules
We characterize which scoring rules are Maskin-monotonic for each social choice problem as a function of the number of agents and the number of alternatives. We show that a scoring rule is Maskin-monotonic if and only if it satisfies a certain unanimity condition. Since scoring rules are neutral, Maskin-monotonicity turns out to be equivalent to Nash-implementability within the class of scoring...
متن کاملSmall Binary Voting Trees
Sophisticated voting on a binary tree is a common form of voting structure, as exemplified by, for example, amendment procedures. The problem of characterizing voting rules that can be the outcome of this procedure has been a longstanding problem in social choice. We explore rules over a small number of candidates, and discuss existence and nonexistence properties of rules implementable over tr...
متن کاملOn Maskin monotonicity of solution based social choice rules
Howard (1992) argues that the Nash bargaining solution is not Nash implementable, as it does not satisfy Maskin monotonicity. His arguments can be extended to other bargaining solutions as well. However, by defining a social choice correspondence that is based on the solution rather than on its realizations, one can overcome this shortcoming. We even show that such correspondences satisfy a str...
متن کاملRenegotiation-Proof Mechanism Design
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and after it is played. We ask (1) what kind of environments admit the renegotiation-proof implementation of some social choice rules? (2) for a given environment, what kind of social choice rule are implementable in a way that is renegotiationproof? and (3) for a given renegotiation-proof implementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 60 شماره
صفحات -
تاریخ انتشار 2007